Inclusion-exclusion principle for belief functions
نویسندگان
چکیده
The inclusion-exclusion principle is a well-known property of set cardinality and probability measures, that is instrumental to solve some problems such as the evaluation of systems reliability or of uncertainty over Boolean formulas. However, when using sets and probabilities conjointly, this principle no longer holds in general. It is therefore useful to know in which cases it is still valid. This paper investigates this question when uncertainty is modelled by belief functions. After exhibiting necessary and sufficient conditions for the principle to hold, we illustrate its use on some applications, i.e. reliability analysis and uncertainty over Boolean formulas. 1
منابع مشابه
The Inclusion-Exclusion Principle for IF-States
Applying two definitions of the union of IF-events, P. Grzegorzewski gave two generalizations of the inclusion-exclusion principle for IF-events.In this paper we prove an inclusion-exclusion principle for IF-states based on a method which can also be used to prove Grzegorzewski's inclusion-exclusion principle for probabilities on IF-events.Finally, we give some applications of this principle by...
متن کاملSymmetric Inclusion-Exclusion
One form of the inclusion-exclusion principle asserts that if A and B are functions of finite sets then the formulas A(S) = ∑ T⊆S B(T ) and B(S) = ∑ T⊆S(−1) |S|−|T A(T ) are equivalent. If we replace B(S) by (−1)B(S) then these formulas take on the symmetric form A(S) = ∑ T⊆S (−1) B(T ) B(S) = ∑ T⊆S (−1) A(T ). which we call symmetric inclusion-exclusion. We study instances of symmetric inclusi...
متن کاملSYMMETRIC INCLUSION - EXCLUSION Ira
One form of the inclusion-exclusion principle asserts that if A and B are functions of finite sets then the formulas A(S) = ∑ T⊆S B(T ) and B(S) = ∑ T⊆S(−1) |A(T ) are equivalent. If we replace B(S) by (−1)|S|B(S) then these formulas take on the symmetric form A(S) = ∑
متن کاملThe Inclusion-exclusion Principle for If-states
Applying two definitions of the union of IF-events, P. Grzegorzewski gave two generalizations of the inclusion-exclusion principle for IF-events. In this paper we prove an inclusion-exclusion principle for IF-states based on a method which can also be used to prove Grzegorzewski’s inclusion-exclusion principle for probabilities on IF-events. Finally, we give some applications of this principle ...
متن کاملThe Inclusion-exclusion Principle without Distributivity
ABSTRACT. Inspired by the article of P. Grzegorzewski [The inclusion-exclusion principle for IF-events, Inform. Sci. 181 (2011), 536–546], who has worked two generalizations of the inclusion-exclusion principle for IF-events, a generalization of the inclusion-exclusion principle for mappings with values in semigroups is presented here. The main idea is in replacing the distributivity and idempo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Approx. Reasoning
دوره 55 شماره
صفحات -
تاریخ انتشار 2014